Selling reduction versus Niggli reduction for crystallographic lattices
نویسندگان
چکیده
منابع مشابه
The geometry of Niggli reduction: BGAOL – embedding Niggli reduction and analysis of boundaries. Erratum
Ambiguities in the article by Andrews & Bernstein [J. Appl. Cryst. (2014), 47, 346-359] are clarified.[This corrects the article DOI: 10.1107/S1600576713031002.].
متن کاملIsodual Reduction of Lattices
We define a new notion of a reduced lattice, based on a quantity introduced in the LLL paper. We show that lattices reduced in this sense are simultaneously reduced in both their primal and dual. We show that the definition applies naturally to blocks, and therefore gives a new hierarchy of polynomial time algorithms for lattice reduction with fixed blocksize. We compare this hierarchy of algor...
متن کاملClosed Reduction versus Open Reduction and Pin Fixation in Pediatric Type III Supracondylar Humeral Fractures
Background Supracondylar humeral fractures constitute about 60% and 13% of all pediatric elbow and pediatric skeletal fractures, respectively, with a peak incidence in the 5-7 years age group. The aim of this study was to evaluate and compare closed reduction with open reduction and pin fixation in type III supracondylar humeral fractures in children younger than...
متن کاملRegularization of Toda lattices by Hamiltonian reduction
The Toda lattice defined by the Hamiltonian H = 12 ∑n i=1 p 2 i + ∑n−1 i=1 νie qi−qi+1 with νi ∈ {±1}, which exhibits singular (blowing up) solutions if some of the νi = −1, can be viewed as the reduced system following from a symmetry reduction of a subsystem of the free particle moving on the group G = SL(n,RI ). The subsystem is T Ge, where Ge = N+AN− consists of the determinant one matrices...
متن کاملDeterministic and Non-deterministic Basis Reduction Techniques for Ntru Lattices
Author: Daniel Socek Title: Deterministic and Non-Deterministic Basis Reduction Techniques for NTRU Lattices Institution: Florida Atlantic University Thesis Advisor: Dr. Spyros S. Magliveras Degree: Master of Science Year: 2002 Finding the shortest or a “short enough” vector in an integral lattice of substantial dimension is a difficult problem. The problem is not known to be but most people be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations and Advances
سال: 2019
ISSN: 2053-2733
DOI: 10.1107/s2053273318015413